Natural and extended formulations for the Time-Dependent Traveling Salesman Problem
نویسندگان
چکیده
منابع مشابه
Natural and extended formulations for the Time-Dependent Traveling Salesman Problem
Consider a graph G=(V,A), where V ={1,2,..,n} and A={(i,j): i,j=1,..,n, i ≠ j}. The TimeDependent Travelling Salesman problem (TDTSP) is to find a minimum cost Hamiltonian circuit, starting and ending on node 1, where arc costs depend on its position in the tour. Thus, to each arc (i,j) in A and each possible position h of the arc in the tour we associate a cost h ij c . Clearly, an arc (1,j) l...
متن کاملExtended formulations and branch-and-cut algorithms for the Black-and-White Traveling Salesman Problem
In this paper we study integer linear programming models and develop branch-and-cut algorithms to solve the Black-and-White Traveling Salesman Problem (BWTSP) [4] which is a variant of the well known Traveling Salesman Problem (TSP). Two strategies to model the BWTSP have been used in the literature. The problem is either modeled on the original graph as TSP using a single set of binary edge va...
متن کاملAn Approach for Solving Traveling Salesman Problem
In this paper, we introduce a new approach for solving the traveling salesman problems (TSP) and provide a solution algorithm for a variant of this problem. The concept of the proposed method is based on the Hungarian algorithm, which has been used to solve an assignment problem for reaching an optimal solution. We introduced a new fittest criterion for crossing over such problems, and illu...
متن کاملThe time dependent traveling salesman problem: polyhedra and algorithm
The Time Dependent Traveling Salesman Problem (TDTSP) is a generalization of the classical Traveling Salesman Problem (TSP), where arc costs depend on their position in the tour with respect to the source node. While TSP instances with thousands of vertices can be solved routinely, there are very challenging TDTSP instances with less than 100 vertices. In this work, we study the polytope associ...
متن کاملNew Formulations for the Generalized Traveling Salesman Problem
The Generalized Traveling Salesman Problem (GTSP) is an extension of the well known Traveling Salesman Problem (TSP). The GTSP is defined on a graph in which the nodes (customers or vertices) are grouped into a given number of clusters (node sets). Solution procedures for the GTSP are generally focused on transforming the problem to the TSP and applying the exact or heuristic solution methods d...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Discrete Applied Mathematics
سال: 2014
ISSN: 0166-218X
DOI: 10.1016/j.dam.2011.11.019